A Simple Adequate Categorical Model for PCF
نویسنده
چکیده
Usually types of PCF are interpreted as cpos and terms as continuous functions. It is then the case that non-termination of a closed term of ground type corresponds to the interpretation being bottom; we say that the semantics is adequate. We shall here present an axiomatic approach to adequacy for PCF in the sense that we will introduce categorical axioms enabling an adequate semantics to be given. We assume the presence of certain “bottom” maps with the role of being the interpretation of non-terminating terms, but the order-structure is left out. This is different from previous approaches where some kind of order-theoretic structure has been considered as part of an adequate categorical model for PCF. We take the point of view that partiality is the fundamental notion from which order-structure should be derived, which is corroborated by the observation that our categorical model induces an order-theoretic model for PCF in a canonical way.
منابع مشابه
Full Abstraction and the Context Lemma 1
It is impossible to add a combinator to PCF to achieve full abstraction for models such asBerry's stable domains in a way analogous to the addition of the \parallel-or" combinatorthat achieves full abstraction for the familiar cpo model. In particular, we de ne a generalnotion of rewriting system of the kind used for evaluating simply typed -terms in Scott'sPCF. Any simply t...
متن کاملStable Bistructure Models of PCF
Stable bistructures are a generalisation of event structures to represent spaces of functions at higher types; the partial order of causal dependency is replaced by two orders, one associated with input and the other output in the behaviour of functions. They represent Berry’s bidomains. The representation can proceed in two stages. Bistructures form a categorical model of Girard’s linear logic...
متن کاملCategorical Models for a Semantically Linear λ-calculus
This paper is about a categorical approach to model a very simple Semantically Linear λcalculus, namedS λ-calculus. This is a core calculus underlying the programming language S PCF. In particular, in this work, we introduce the notion of S λ-Category, which is able to describe a very large class of sound models of S λ-calculus. S λ-Category extends in the natural way Benton, Bierman, Hyland an...
متن کاملFull Abstraction for PCF
An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain “history-free” strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable in a certain simple extension of PCF. We then introduce an intrinsic preorder on strategies, and show that i...
متن کاملOn Classical PCF, Linear Logic and the MIX Rule
We study a classical version of PCF from a semantic point of view. We define a general notion of model based on categorical models of Linear Logic, in the spirit of earlier work by Girard, Regnier and Laurent. We give a concrete example based on the relational model of Linear Logic, that we present as a non-idempotent intersection type system, and we prove an Adequacy Theorem using ideas introd...
متن کامل